منابع مشابه
List Coloring Hypergraphs
Let H be a hypergraph and let Lv : v ∈ V (H) be sets; we refer to these sets as lists and their elements as colors. A list coloring of H is an assignment of a color from Lv to each v ∈ V (H) in such a way that every edge of H contains a pair of vertices of different colors. The hypergraph H is k-list-colorable if it has a list coloring from any collection of lists of size k. The list chromatic ...
متن کاملList coloring triangle-free hypergraphs
A triangle in a hypergraph is a collection of distinct vertices u, v, w and distinct edges e, f, g with u, v ∈ e, v, w ∈ f , w, u ∈ g and {u, v, w} ∩ e ∩ f ∩ g = ∅. Johansson [11] proved that every triangle-free graph with maximum degree ∆ has list chromatic number O(∆/ log ∆). Frieze and the second author [8] proved that every linear (meaning that every two edges share at most one vertex) tria...
متن کاملAdapted List Coloring of Graphs and Hypergraphs
We introduce and study adapted list coloring of graphs and hypergraphs. This is a generalization of ordinary list coloring and adapted coloring, and has more applications than these. We prove that the upper bounds on the adaptable choosability of graphs and uniform hypergraphs in terms of maximum degree are sufficiently stronger than those on the ordinary choosability, while the bounds in terms...
متن کاملExact Algorithms for List-Coloring of Intersecting Hypergraphs
We show that list-coloring for any intersecting hypergraph of m edges on n vertices, and lists drawn from a set of size at most k, can be checked in quasi-polynomial time (mn)o(k log(mn)). 1998 ACM Subject Classification G.2.1 Combinatorial algorithms, G.2.2 Hypergraphs
متن کاملOnline coloring of hypergraphs
We give a tight bound on randomized online coloring of hypergraphs. The bound holds even if the algorithm knows the hypergraph in advance (but not the ordering in which it is presented). More specifically, we show that for any n and k, there is a 2colorable k-uniform hypergraph on n vertices for which any randomized online coloring uses Ω(n/k) colors in expectation. 1 Online Hypergraph Coloring...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2010
ISSN: 1077-8926
DOI: 10.37236/401